منابع مشابه
Tree-Ramsey numbers
We denote by r'( G I , G2 ) the ramsey number of two graphs and G2 • If Tp+l is a tree of order p + 1 which is not a star, and if jJ is not a divisor of the positive integer q 1, then we shall show that r(Tp+b ](l,q) ::; p + q 1, and we shall describe some trees and stars for which equality holds. Furthermore. we detf'rmine the ramsey numbers r(T;+l' Tq*+l) for p, q ~ 4, where T~ denotes a tree...
متن کاملExtremal theory and bipartite graph-tree Ramsey numbers
For a positive integer n and graph B, fa (n) is the least integer m such that any graph of order n and minimal degree m has a copy of B. It will be show that if B is a bipartite graph with parts of order k and i (k-1), then there exists a positive constant c, such that for any tree T of order n and for any j (0-j _-(k-1)), the Ramsey number r(T, B) < n + c-(fe (n)) 't(k-1) if A(T)-(n/(k-j-1))-(...
متن کاملOn Geometric Graph Ramsey Numbers
For any two-colouring of the segments determined by 3n− 3 points in general position in the plane, either the first colour class contains a triangle, or there is a noncrossing cycle of length n in the second colour class, and this result is tight. We also give a series of more general estimates on off-diagonal geometric graph Ramsey numbers in the same spirit. Finally we investigate the existen...
متن کاملMultipartite graph - space graph Ramsey numbers
The Ramsey number r(F, G) is the least number N such that in every two-coloring (R, B)=(red, blue) of the edges of KN , either there is a red copy of F or else a blue copy of G . The inequality (1) holds in view of the fact that the edges of the complete graph of order (m-1) (n-1) +s-1 can be given the coloring in which the blue graph, denoted (B), is isomorphic to (m-1)K„_~UKS_~ . Then the red...
متن کاملGraph classes and Ramsey numbers
For a graph class G and any two positive integers i and j, the Ramsey number RG(i, j) is the smallest positive integer such that every graph in G on at least RG(i, j) vertices has a clique of size i or an independent set of size j. For the class of all graphs, Ramsey numbers are notoriously hard to determine, and they are known only for very small values of i and j. Even if we restrict G to be ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1988
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90200-2